A Note on a Recent Attempt to Improve the Pin-Frankl Bound

نویسندگان

  • François Gonze
  • Raphaël M. Jungers
  • Avraham Trakhtman
چکیده

We provide a counterexample to a lemma used in a recent tentative improvement of the the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of proof, and improve the bound.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronizing Automata with Extremal Properties

We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some cons...

متن کامل

Improving the Upper Bound on the Length of the Shortest Reset Word

We improve the best upper bound on the length of the shortest reset words of synchronizing automata. The new bound is (15617n + 7500n + 9375n− 31250)/93750. So far, the best general upper bound was (n − n)/6 − 1 obtained by Pin and Frankl in 1983. Despite a number of efforts, the bound remained unchanged for about 34 years. The new upper bound improves the coefficient 1/6 at n by 4/46875. A wor...

متن کامل

A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...

متن کامل

بهبود کران بالا روی بعد همدیس میدان‌های اولیه

Modular invarinat, constraints the spectrum of the theory. Using the medum temprature expansion, for first and third order of derivative, a universal upper bound on the lowest primary field has been obtained in recent researches.  In this paper, we will improve the upper bound on the scaling dimension of the lowest primary field. We use by the medium temprature expansion for an arbitrary orders...

متن کامل

A Comprehensive Performance Analysis of Direct Detection Receivers inWDMASystems

In this work the performance of a wavelength division multiple access (WDMA) system with direct detection receiver is investigated. For this purpose, the probability of error in a WDMA network with OOK modulation considering crosstalk, ISI, photo detector noise and thermal noise is calculated and the effect of each on system performance is investigated. The system performance in presence of PIN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics & Theoretical Computer Science

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2015